Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem

This paper presents a multi-start iterated local search (MS-ILS), an exact approach based on improved integer linear programming (ILP) model, and matheuristic combining the ILP with MS-ILS through solution merging for minimum capacitated dominating set (CAPMDS) problem undirected graphs. is extension of well-known problem, where there cap number nodes that each node can dominate, goal to find cardinality dominated within this cap. NP-hard has several real world applications in resource constrained environments such as clustering wireless sensor networks along selection cluster heads, document summarization information retrieval. Computational results standard benchmark instances show superiority our approaches over state-of-the-art available literature their respective categories.